All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9
نویسندگان
چکیده
منابع مشابه
All Ramsey numbers r ( K 3 , G ) for connected graphs of order 9 Stephan Brandt
We determine the Ramsey numbers r(K3, G) for all 261080 connected graphs of order 9 and further Ramsey numbers of this type for some graphs of order up to 12. Almost all of them were determined by computer programs which are based on a program for generating maximal triangle-free graphs.
متن کاملAll Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9
We determine the Ramsey numbers r(K3, G) for all 261080 connected graphs of order 9 and further Ramsey numbers of this type for some graphs of order up to 12. Almost all of them were determined by computer programs which are based on a program for generating maximal triangle-free graphs.
متن کاملAll Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8
In this paper we will give all Ramsey numbers r(K 3 ; G) for connected graphs G of order 7 and 8. For smaller orders and not connected graphs of order up to 8, the number of graphs with given Ramsey number is listed for all possible values.
متن کاملAll Ramsey Numbers for Brooms in Graphs
For k, ` > 1, a broom Bk,` is a tree on n = k + ` vertices obtained by connecting the central vertex of a star K1,k with an end-vertex of a path on `− 1 vertices. As Bn−2,2 is a star and B1,n−1 is a path, their Ramsey number have been determined among rarely known R(Tn) of trees Tn of order n. Erdős, Faudree, Rousseau and Schelp determined the value of R(Bk,`) for ` > 2k > 2. We shall determine...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1998
ISSN: 1077-8926
DOI: 10.37236/1345